Idea: Towards a Working Fully Homomorphic Crypto-processor - Practice and the Secret Computer
نویسندگان
چکیده
Abstract. A KPU is a replacement for a standard RISC processor that natively runs encrypted machine code on encrypted data in registers and memory – a ‘general-purpose crypto-processor’, in other words. It works because the processor’s arithmetic is customised to make the chosen encryption into a mathematical homomorphism, resulting in what is called a ‘fully-homomorphic encryption’ design. This paper discusses the problems and solutions associated with implementing a KPU in hardware.
منابع مشابه
A Fully Encrypted Microprocessor The Secret Computer is Nearly Here
Following a sequence of hardware designs for a fully homomorphic crypto-processor – a general purpose processor that natively runs encrypted machine code on encrypted data in registers and memory, resulting in encrypted machine states – proposed by the authors in 2014, we discuss a working prototype of the first of those, a so-called ‘pseudo-homomorphic’ design. This processor is in principle s...
متن کاملThreshold Fully Homomorphic Encryption
We formally define and give the first construction of (leveled) threshold fully homomorphic encryption for any access structure induced by a monotone boolean formula and in particular for the threshold access structure. Our construction is based on the learning with errors assumption and can be instantiated with any existing homomorphic encryption scheme that satisfies fairly general conditions...
متن کاملFully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
We present a somewhat homomorphic encryption scheme that is both very simple to describe and analyze, and whose security (quantumly) reduces to the worst-case hardness of problems on ideal lattices. We then transform it into a fully homomorphic encryption scheme using standard “squashing” and “bootstrapping” techniques introduced by Gentry (STOC 2009). One of the obstacles in going from “somewh...
متن کاملBootstrappable Identity-Based Fully Homomorphic Encryption
It has been an open problem for a number of years to construct an identity-based fully homomorphic encryption (IBFHE) scheme (first mentioned by Naccache at CHES/CRYPTO 2010). At CRYPTO 2013, Gentry, Sahai and Waters largely settled the problem by presenting leveled IBFHE constructions based on the Learning With Errors problem. However their constructions are not bootstrappable, and as a result...
متن کاملReaction Attack on Outsourced Computing with Fully Homomorphic Encryption Schemes
Outsourced computations enable more efficient solutions towards practical problems that require major computations. Nevertheless, users’ privacy remains as a major challenge, as the service provider can access users’ data freely. It has been shown that fully homomorphic encryption schemes might be the perfect solution, as it allows one party to process users’ data homomorphically, without the n...
متن کامل